Combinatorial families that are exponentially far from being listable in Gray code sequence
نویسندگان
چکیده
منابع مشابه
Combinatorial Families That Are Exponentially Far from Being Listable in Gray Code Sequence
Let S(n) be a collection of subsets of {1, ..., n}. In this paper we study numerical obstructions to the existence of orderings of S(n) for which the cardinalities of successive subsets satisfy congruence conditions. Gray code orders provide an example of such orderings. We say that an ordering of S(n) is a Gray code order if successive subsets differ by the adjunction or deletion of a single e...
متن کاملOn Snarks that are far from being 3-Edge Colorable
In this note we construct two infinite snark families which have high oddness and low circumference compared to the number of vertices. Using this construction, we also give a counterexample to a suggested strengthening of Fulkerson’s conjecture by showing that the Petersen graph is not the only cyclically 4-edge connected cubic graph which require at least five perfect matchings to cover its e...
متن کاملGray Code Enumeration of Families of Integer Partitions
In this paper we show that the elements of certain families of integer partitions can be listed in a minimal change, or Gray code, order. In particular, we construct Gray code listings for the classes Pδ(n, k) and D(n, k) of partitions of n into parts of size at most k in which, for Pδ(n, k), the parts are congruent to one modulo δ and, for D(n, k), the parts are distinct. The change required b...
متن کاملParallel binary reflected Gray code sequence generation on multicore architectures
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملThere Are Exponentially Many Ternary Words That Avoid Abelian Cubes
We show that the number of ternary words of length n that avoid abelian cubes is Ω(βn), where β = 21/36.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1999
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-99-02229-1